Tailoring Recursion for Complexity
نویسندگان
چکیده
We design functional algebras that characterize various complexity classes of global functions. For this purpose, classical schemata from recursion theory are tailored for capturing complexity. In particular we present a functional analogue of rst-order logic and describe algebras of the functions computable in nondeterministic logarithmic space, deterministic and nondeterministic polynomial time, and for the functions computable by AC-circuits.
منابع مشابه
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We show that the levels of the polynomial hierarchy correspond to safe recursion with predicative minimization. The levels of the digital polynomial hierarchy correspond to safe recursion with digital predicative minimiz...
متن کاملRecursion schemata for NC
We give a recursion-theoretic characterization of the complexity classes NC for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computati...
متن کاملSupporting Tailorability of Groupware through Component Architectures
Tailorability is generally regarded as a key property of CSCW-systems, because cooperative activities provide for very dynamic and diversified requirements. Extensive tailorability has to be supported by the architecture of the application, which is determined by the design of the groupware platform. This contribution points out the value of a scaleable component architecture for groupware appl...
متن کاملRecursion Schemata for NCk
We give a recursion-theoretic characterization of the complexity classes NC for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computati...
متن کاملTailorable component architectures for CSCW-systems
Tailorability is generally regarded as a key property of CSCW-systems, because cooperative activities provide for very dynamic and diversified requirements. Extensive tailorability has to be supported by the design of the system architecture. In this contribution we investigate the value of component architectures for this purpose and discuss several design options for the questions raised by t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 60 شماره
صفحات -
تاریخ انتشار 1995